منابع مشابه
Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messages. Our approach utilizes a recent method for identifying the propagated join tree messages à priori. When it is determined that precisely one message is to be constructed at a join tree node, VE is utilized to build t...
متن کاملA time-reversal mirror with variable range focusing
Recently a time-reversal mirror ~or phase-conjugate array! was demonstrated experimentally in the ocean that spatially and temporally refocused an incident acoustic field back to the original position of the probe source @Kuperman et al., J. Acoust. Soc. Am. 103, 25–40 ~1998!#. Here this waveguide time-reversal mirror technique is extended to refocus at ranges other than that of the probe sourc...
متن کاملA Critique of the Marker Variable Technique: The Effect of Alternative Marker Variable Criteria
The marker variable technique offers a practical and easy method to address the validity threat on account of common method variance to the findings of individual studies. However, the validity of the marker variable technique has not been established. This paper examines the validity threat to the marker variable technique arising from multiple criteria for the selection of the marker variable...
متن کاملA Faster Alternative to SSS* with Extension to Variable Memory
The two best known and most frequently referenced minimax search methods for game trees are Alpha-Beta [2] and SSS* [6]. The algorithms are quite dissimilar in structure and properties. Alpha-Beta is a depth-first recursive procedure that needs little memory to execute. Although it evaluates more terminal nodes than SSS*, it generally runs considerably faster owing to its low overhead. In contr...
متن کاملAppeals immune bargaining solution with variable alternative sets
A bargaining solution based on the Rubinstein–Safra–Thomson ‘ordinal Nash’ outcome is investigated in the Peters–Wakker ‘revealed group preferences’ framework. Assuming non-expected utility preferences, necessary and sufficient conditions are stated on preference pairs in order for the solution to be well-defined and axiomatized uniquely. © 2006 Elsevier Inc. All rights reserved. JEL classifica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finance Research Letters
سال: 2020
ISSN: 1544-6123
DOI: 10.1016/j.frl.2019.06.025